A Fast Slack Stealing method for embedded Real-Time Systems
نویسندگان
چکیده
In this paper we present a low-cost Slack-Stealing method, named Fast Slack, to be employed in a Fixed Priority scheduling mechanism. The slack obtained is intended to improve the execution of non-critical tasks without jeopardizing the schedulability of the critical ones. The method is compared with the most important one in the realtime theory. We show that the complexity of this method is suitable to be implemented online in embedded realtime systems. Besides, we can determine online the amount of time that the calculus of the slack will take.
منابع مشابه
Scheduling slack time in fixed priority pre-emptive systems
This report addresses the problem of jointly scheduling tasks with both hard and soft time constraints. We present new analysis which builds upon previous research into slack stealing algorithms. Our analysis determines the maximum processing time which may be stolen from hard deadline periodic or sporadic tasks, without jeopardising their timing constraints. It extends to tasks with characteri...
متن کاملA Hardware Architecture for Scheduling Complex Real-Time Task Sets
The problem of jointly scheduling both hard deadline periodic tasks and soft aperiodic tasks has been the subject of considerable research in real-time systems. One of the most widely accepted solutions for this problem are slack stealing algorithms. However, these algorithms are rather impractical, since they all imply a considerable scheduler overhead. This paper faces the overhead problem by...
متن کاملPrioritizing Soft Real-Time Tasks to Improve End-to-End Response Time in Distributed Control Systems
In distributed control systems, real-time tasks may be classi ed into local tasks and global tasks. Local tasks are usually bound to a speci c node and responsible for hard real-time functions to control I/O devices whereas global tasks perform soft real-time functions such as data logging, status reporting, and statistical analysis. Such a global task is divided into several subtasks each of w...
متن کاملApproximate Slack Stealing Algorithms for Fixed Priority Pre-emptive Systems
Recent research into the problem of jointly scheduling tasks with both hard and soft time constraints has focused on the development of optimal slack stealing algorithms. Theoretically, these optimal algorithms offer significant performance improvements over previous bandwidth preserving algorithms such as the Sporadic Server or Extended Priority Exchange algorithm. However, there are problems ...
متن کاملA Dynamic Slack Management Technique for Real-Time Distributed Embedded System
This work presents a novel slack management technique, the ’Service Rate Proportionate(SRP) Slack Distribution’, for real-time distributed embedded systems to reduce energy consumption. The proposed SRP based Slack Distribution Technique has been considered with EDF and Rate Based scheduling schemes that are most commonly used with embedded systems. A fault tolerance mechanism has also been inc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005